Network flow problem - PDFSEARCH.IO - Document Search Engine

Network flow problem
Results: 219

#	Item
141	Fast Minimum-Register Retiming via Binary Maximum-Flow Alan Mishchenko Aaron Hurst Robert Brayton Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2006-11-20 10:30:53 Formal methods Electronics Retiming Electronic design automation Maximum flow problem Flow network Digital electronics Ford–Fulkerson algorithm Logic gate Network flow Electronic engineering Mathematics
142	International Scholarly Research Network ISRN Communications and Networking Volume 2012, Article ID[removed], 19 pages doi:[removed][removed]Review Article Add to Reading List Source URL: downloads.hindawi.com Language: English - Date: 2014-08-14 11:59:42 Connectivity Maximum flow problem Topology Cut Connected component Breadth-first search Disjoint-set data structure Pseudoforest Centrality Graph theory Mathematics Graph connectivity
143	Graph Evolution: Densification and Shrinking Diameters JURE LESKOVEC Carnegie Mellon University JON KLEINBERG Cornell University Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:52 Network theory Evolving networks Small-world network Degree distribution Random graph Centrality Shortest path problem Graph Flow network Graph theory Mathematics Networks
144	UniALT for Regular Language Constrained Shortest Paths on a Multi-Modal Transportation Network Dominik Kirchler1,2,3 , Leo Liberti1 , Thomas Pajor4 , and Roberto Wolfler Calvo2 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2011-09-19 09:22:17 Network flow Network theory Operations research Shortest path problem Flow network Distance Routing algorithms Graph theory Mathematics Theoretical computer science
145	Microsoft Word - minreg-fmcad-final3.doc Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2007-07-30 11:41:26 Combinatorial optimization Formal methods Combinatorics Retiming Maximum flow problem Flow network Minimum cut Cut Minimum-cost flow problem Network flow Graph theory Mathematics
146	A Survey of Sensor Selection Schemes in Wireless Sensor Networks Hosam Rowaihy1 , Sharanya Eswaran1 , Matthew Johnson2 , Dinesh Verma3 , Amotz Bar-Noy2 , Theodore Brown2 and Thomas La Porta1 1 Pennsylvania Add to Reading List Source URL: www.cse.psu.edu Language: English - Date: 2007-05-29 15:25:51 Wireless sensor network Computer networking Sensor node Matching Bipartite graph Maximum flow problem Flow network Static single assignment form Graph theory Mathematics Network flow
147	Achieving Allocatively-Efficient and Strongly Budget-Balanced Mechanisms in the Network Flow Domain for Bounded-Rational Agents Yoram Bachrach and Jeffrey S. Rosenschein {yori, jeff}@cs.huji.ac.il School of Engineering a Add to Reading List Source URL: www.ijcai.org Language: English - Date: 2005-07-11 16:49:14 Game theory Network flow Auctioneering Networks NP-complete problems Vertex cover Maximum flow problem Vickrey–Clarke–Groves auction Strategyproof Graph theory Mathematics Theoretical computer science
148	Point-to-Point Shortest Path Algorithms with Preprocessing Andrew V. Goldberg Microsoft Research – Silicon Valley 1065 La Avenida, Mountain View, CA 94062, USA [removed] URL: http://www.research.microsoft. Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2007-05-08 19:26:12 Routing algorithms Network theory Search algorithms Shortest path problem Distance Graph Tree Breadth-first search Flow network Graph theory Mathematics Theoretical computer science
149	Seeking Stable Clusters in the Blogosphere Nilesh Bansal Fei Chiang University of Toronto Add to Reading List Source URL: www.vldb.org Language: English - Date: 2007-07-31 04:33:24 Search algorithms Network flow Depth-first search Breadth-first search Correlation clustering Maximum flow problem Flow network Tree Connectivity Graph theory Mathematics Combinatorics
150	40TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, PRINCETON UNIVERSITY, MARCH 22–24, [removed]Multi-Source Grid Scheduling for Divisible Loads Thomas G. Robertazzi∗ and Dantong Yu∗∗ Add to Reading List Source URL: www.ee.sunysb.edu Language: English - Date: 2006-04-07 16:04:19 Electronic engineering Routing Load balancing Network management Flow network Scheduling Current source Multi-commodity flow problem Network analysis Network flow Electromagnetism Electricity

UPDATE